(P_5)- Factorization of Complete Bipartite Symmetric Digraphs
نویسندگان
چکیده
منابع مشابه
P3-factorization of complete bipartite symmetric digraphs
In path factorization, H. Wang [1] gives the necessary and sufficient conditions for the existence of P_k-factorization of a complete bipartite graph for k, an even integer. Further, Beiling Du [2] extended the work of H. Wang, and studied the P_2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers. P_3-factorization ...
متن کاملBigraph-factorization of symmetric complete bipartite multi-digraphs
We show that a necessary and sufficient condition for the existence of a Kp,q factorization of the symmetric complete bipartite multi-digraph )"K:n n is (i) m = n == 0 (mod p) for p = q and (ii) m = n == a (mod d(p' + q')p'q'/e) for p =f. q, where d = (p,q), p' = p/d, q' = q/d, e = ()..,p'q').
متن کاملSemi-evenly partite star-factorization of symmetric complete tripartite digraphs
We show that necessary and sufficient conditions for the existence of a semi-evenly partite star factorization of the symmetric complete tripartite digraph K~I,n2,n3 are (i) k is even, k 2 4 and (ii) nl = n2 = n3 == 0 (mod k(k -1)/3) for k == 0 (mod 6) and nl = n2 = n3 == 0 (mod k(k 1)) for k == 2,4 (mod 6).
متن کاملEvenly partite bigraph-factorization of symmetric complete tripartite digraphs
We show that a necessary and sufficient condition for the existence of a Kp ,2q factorization of the symmetric complete tripartite digraph K~1,n2,n3 is (i) ni = n2 = n3 == 0 (mod p) for p = q, (ii) ni = n2 = n3 == 0 (mod dp'q'(p' + 2q')) for p =Iq and p' odd, (iii) ni = n2 = n3 == 0 (mod dp'q'(p' + 2q')/2) for p =Iq and p' even, where d = (p, q), p' = p/d, q' = q/d.
متن کاملP 9 - Factorization of Complete Bipartite Graph
Pk -factorization of a complete bipartite graph for k, an even integer was studied by H. Wang [1]. Further, Beiling Du [2] extended the work of H.Wang, and studied the P2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers[3,4,5]. P3-factorization of complete bipartite graph was studied by K.Ushio [3]. P5-factorizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12845-0234